On the Helgason-Johnson Bound
نویسندگان
چکیده
Let G be a simple non-compact linear Lie group. ? any irreducible unitary representation of with infinitesimal character ? whose continuous part is ?. The beautiful Helgason-Jonson bound in 1969 says that the norm ? upper bounded by ?(G), which stands for half sum positive roots G. current paper aims to give framework sharpen Helgason—Johnson when infinite-dimensional. We have explicit results exceptional groups. Ingredients proof include Parthasarathy’s Dirac operator inequality, Vogan pencil, and unitarily small convex hull introduced Salamanca-Riba Vogan.
منابع مشابه
Improvements on the Johnson bound for Reed-Solomon codes
For Reed-Solomon Codes with block length n and dimension k, the Johnson theorem states that for a Hamming ball of radius smaller than n − √ nk, there can be at most O(n) codewords. It was not known whether for larger radius, the number of code words is polynomial. The best known list decoding algorithm for Reed-Solomon Codes due to Guruswami and Sudan [13] is also known to work in polynomial ti...
متن کاملAn improvement of the Johnson bound for subspace codes
Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective qr-divisible codes.
متن کاملOn the Johnson - Neyman
The Johnson-Neyman technique is a statistical tool used most frequently in educational and psychological applications. This paper starts by briefly reviewing the JohnsonNeyman technique and suggesting when it should and should not be used; then several different modifications and extensions of the Johnson-Neyman technique, all of them conceptually simple, are proposed. The close relation betwee...
متن کاملOn the Failing Cases of the Johnson Bound for Error-Correcting Codes
A central problem in coding theory is to determine Aq(n, 2e + 1), the maximal cardinality of a q-ary code of length n correcting up to e errors. When e is fixed and n is large, the best upper bound for A(n, 2e+1) (the binary case) is the well-known Johnson bound from 1962. This however simply reduces to the sphere-packing bound if a Steiner system S(e + 1, 2e + 1, n) exists. Despite the fact th...
متن کاملSeparating hash families: A Johnson-type bound and new constructions
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory, we solve several open problems and conjectures concerning bounds and constructions for separating hash families. Firstly, we discover that the cardinality of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2022
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-022-2403-6